Entailment and Disentailment of Order-Sorted Feature Constraints
نویسندگان
چکیده
LIFE uses matching on order-sorted feature structures for passing arguments to functions. As opposed to uni cation which amounts to normalizing a conjunction of constraints, solving a matching problem consists of deciding whether a constraint (guard) or its negation are entailed by the context. We give a complete and consistent set of rules for entailment and disentailment of order-sorted feature constraints. These rules are directly usable for relative simpli cation, a general proof-theoretic method for proving guards in concurrent constraint logic languages using guarded rules.
منابع مشابه
Entailment and Disentailment of Order-sorted Feature Constraints (summary)
LIFE uses matching on order-sorted feature structures for passing arguments to functions. As opposed to uniication which amounts to normalizing a conjunction of constraints, solving a matching problem consists of deciding whether a constraint (guard) or its negation are entailed by the context. We give a complete and consistent set of rules for entailment and disentailment of order-sorted featu...
متن کاملRecords for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where ner-grained constraints are used, and where subtrees are identiied by keywords rather than by position. CFT is deened by a rst-order structure consisting of so-called feature trees. Feature tree...
متن کاملSituated Simpli cation ?
Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the rst time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., AKL or Oz). The algorithm is presented as the simpliication of the constrain...
متن کاملSituated Simplification
Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the first time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., in AKL or in Oz). The algorithm is presented as the simplz+ztion of the co...
متن کاملSituated Simpliication
Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the rst time, an incremental algorithm for the simultaneous tests of en-tailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., in AKL or in Oz). The algorithm is presented as the simpliication of the co...
متن کامل